Graphs whose edge set can be partitioned into maximum matchings
نویسنده
چکیده
This article provides structural characterization of simple graphs whose edge-set can be partitioned into maximum matchings. We use Vizing’s classification of simple graphs based on edge chromatic index.
منابع مشابه
Induced matchings in cubic graphs
In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdos and NeSetiil: For each d 2 3, the edge set of a graph of maximum degree d can always be partitioned into [5d2/4] subsets each of which induces a matching.
متن کاملMatchings in Geometric Graphs
A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect if it matches all the vertices of the underling graph. A geometric matching is a matching in a geometric graph. In this thesis, we study matching problems in...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملUniquely Restricted Matchings and Edge Colorings
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. This notion was defined by Golumbic, Hirst, and Lewenstein and studied in a number of articles. Our contribution is twofold. We provide approximation algorithms for computing a uniquely restricted matching of maximum size in some bipartite graphs. In particular, we achieve a ratio of 9/5 f...
متن کاملPacking Plane Perfect Matchings into a Point Set
Let P be a set of n points in general position in the plane (no three points on a line). A geometric graph G = (P,E) is a graph whose vertex set is P and whose edge set E is a set of straight-line segments with endpoints in P . We say that two edges of G cross each other if they have a point in common that is interior to both edges. Two edges are disjoint if they have no point in common. A subg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1210.4710 شماره
صفحات -
تاریخ انتشار 2012